package com.ulyssesss.ds.base;

/**
 * 二叉搜索树结点
 *
 * @author jiangyue
 */
public class BinarySearchTreeNode {

    private int data;

    private BinarySearchTreeNode left;

    private BinarySearchTreeNode right;

    public int getData() {
        return data;
    }

    public void setData(int data) {
        this.data = data;
    }

    public BinarySearchTreeNode getLeft() {
        return left;
    }

    public void setLeft(BinarySearchTreeNode left) {
        this.left = left;
    }

    public BinarySearchTreeNode getRight() {
        return right;
    }

    public void setRight(BinarySearchTreeNode right) {
        this.right = right;
    }
}
